Even and Odd Pairs of Lattice Paths with Multiple Intersections

نویسندگان

  • Ira M. Gessel
  • Walter Shur
چکیده

Let be the number of ordered pairs of paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Let and We study the numbers , , , and , prove several simple relations among them, and derive a simpler formula for than appears in [1].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Pairs of Lattice Paths with a Given Number of Intersections

The purpose of this paper is to enumerate bijectively the number of ordered pairs of certain lattice paths: Consider paths in the integer lattice Z_Z that proceed with unit steps in either of the directions east or north. Let M k r, s be the set of ordered pairs of such paths that intersect exactly k times (i.e., that have k lattice points in common) in which both paths start at the origin (0, ...

متن کامل

Even and odd pairs in linegraphs of bipartite graphs

Two vertices in a graph are called an even pair (odd pair) if all induced paths between these two vertices have even (odd) length. Even and odd pairs have turned out to be of importance in conjunction with perfect graphs. We will characterize all linegraphs of bipartite graphs that contain an even resp. odd pair. In general, it is a co-NP-complete problem to decide whether a graph contains an e...

متن کامل

Counting Pairs of Lattice Paths by Intersections

Consider an r × (n − r) plane lattice rectangle, and walks that begin at the origin (south-west corner), proceed with unit steps in either of the directions east or north, and terminate at the north-east corner of the rectangle. For each integer k we ask for N k , the number of ordered pairs of these walks that intersect in exactly k points. The number of points in the intersection of two such ...

متن کامل

Skolem Odd Difference Mean Graphs

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

متن کامل

Analytic Approach to Investigation of Fluctuation and Frequency of the Oscillators with Odd and Even Nonlinearities

In this paper we examine fluctuation and frequency of the governing equation ofoscillator with odd and even nonlinearities without damping and we present a new efficientmodification of the He’s homotopy perturbation method for this equation. We applied standard andmodified homotopy perturbation method and compare them with the numerical solution (NS), also weapplied He’s Energy balance method (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 75  شماره 

صفحات  -

تاریخ انتشار 1996